Efficient methodology for Encrypting Amazigh Alphabet using Modified Knapsack Algorithm based ECC

With the development of computers there has been strong demand for means to protect information and to provide security. Recently, security of Amazigh characters has become a growing field in which several research efforts have been made. In this context this paper provides a novel methodology for encrypting Amazigh characters which is the combination of ECC cryptosystem and Knapsack Algorithm through which each character of the message will be strongly encrypted. This paper demonstrates how to strengthen the encrypted message being sent by use of Knapsack algorithm so that only the intended recipient of the message is able to decipher the message. Encryption and decryption process are given in details with an example. A comparison of the proposed technique with existing algorithms has been done in encryption and decryption time

A New Encryption Algorithm to Increase Security of Amazigh Text through Tree Traversal Technique

In recent years network security has become an important issue. Cryptography is one of the mathematical techniques that ensure secure communications within a non-secure channel. It basically deals with encryption and decryption of a given data. Recently, Elliptic Curve Cryptography (ECC) gained a lot of attention in the field of Cryptography. This paper deals with a new approach to enhance the security of Amazigh text using ECC and tree traversal technique. The Amazigh text is the composition of some character. Every character of the message can be represented as a Unicode value. Depending on the chosen key, the codes point is encrypted and scrambled using tree traversal method. The enhanced approach improved the efficiency of the ECC algorithm. Moreover, the use of tree traversing will provide better performance in this regard

Embedding-based Method for the Supervised Link Prediction in Social Networks

In recent years, social network analysis has received a lot of interest. Link prediction is an important area of research in this field that uses information from current networks to predict the likely links that will emerge in the future. It has attracted considerable attention from interdisciplinary research communities due to its ubiquitous applications in biological networks, computer science, transportation networks, bioinformatics, telecommunication networks, and so on. Currently, supervised machine learning is one of the critical techniques in the link prediction task. Several algorithms have been developed by many authors to predict the future link in the network, but there is still scope to improve the previous approaches. In the supervised link prediction process, feature selection is a crucial step. Most existing algorithms use one type of similarity-based feature to represent data, which is not well described due to the large scale and heterogeneity of social networks. One of the newest techniques for link prediction is embedding methods, which are used to preparing the feature vector for each the nonexisting links in the network. In this paper, we introduce a novel approach to supervised link prediction based on feature embedding methods in order to achieve better performance. Our contribution considers a set of embedding methods as the feature vector for training the machine learning classifiers. The main focus of this work is to investigate the relevance of different feature embedding methods to improve the performance of the supervised link prediction models. The experimental results on some real-world temporal networks revealed satisfactory results, which encourage us for further analysis. Moreover, the use of feature embedding methods will provide better performance in this regard

An Enhanced Approach of Elliptic Curve Cryptosystem based Unicode Representation

Data encryption is an important issue and widely used in recent times to ensure security. Elliptic Curve Cryptography (ECC) is one of the most efficient techniques that are used in public key cryptography, because it is difficult for the adversary to solve the elliptic curve discrete logarithm problem to know the secret key that is used in encryption and decryption processes. ECC is more complex and thus it provides greater security and more efficient performance. This paper aims to propose an enhanced approach of elliptic curve cryptosystem based Unicode representation. The proposed technique transforms the text message into an affine point called Pm on the elliptic curve, over the finite field GF(p). Each character in the text message is represented by its Unicode value denoted by two digits and separated into two values. Then, the addition and doubling operations are performed on each value to obtain an affine point on elliptic curve. This transformation makes cryptosystem more secure and complicated to resist the adversaries. Further, the use of Unicode representation will provide better performance in this regard

An More effective Approach of ECC Encryption Algorithm using DNA Computing

Now a day’s Cryptography is one of the broad areas for researchers. Encryption is most effective way to achieve data security. Cryptographic system entails the study of mathematical techniques of encryption and decryption to solve security problems in communication. Elliptic Curve Cryptography (ECC) is one of the most efficient techniques that are used for this issue. Many researchers have tried to exploit the features of ECC field for security applications. This paper describes an efficient approach based elliptic curve and DNA computing. The security of the scheme is based on Elliptic Curve Discrete Logarithm Problem (ECDLP). Existing DNA based cryptography technique need more computational power and more processing time with larger key sizes to provide higher level of security. The main goal of our construction is to enhance the security of elliptic curve cryptosystem using DNA Computing. Both image and text data are encrypted successfully

A Novel Digital Signature based on Error Correcting Codes

A digital signature is a cryptographic primitive for ensuring the authenticity of digital documents. A valid digital signature allows checking that a message was created by a known sender (authentication), that the sender cannot deny having sent the message (nonrepudiation), and that the message was not altered in transit (integrity).The idea of constructing practical signatures based on error correcting codes was introduced by Courtois et al in [1]. The main goal is to make digital signature for which the security is based on decoding syndrome problem. In this paper, a new construction of digital signature is considered which is an extension of the error correcting code construction. The proposed method consists of reordering the message bits to get a decodable word. Then apply an efficient decoding algorithm to get signature

An Innovative Approach for Enhancing Cloud Data Security using Attribute based Encryption and ECC

Cloud computing is future for upcoming generations. Nowadays various companies are looking to use Cloud computing services, as it may benefit them in terms of price, reliability and unlimited storage capacity. Providing security and privacy protection for the cloud data is one of the most difficult task in recent days. One of the measures which customers can take care of is to encrypt their data before it is stored on the cloud. Recently, the attribute-based encryption (ABE) is a popular solution to achieve secure data transmission and storage in the cloud computing. In this paper, an efficient hybrid approach using attribute-based encryption scheme and ECC is proposed to enhance the security and privacy issues in cloud. Here, the proposed scheme is based on Cipher text-Policy Attribute Based Encryption (CP-ABE) without bilinear pairing operations. In this approach, the computation-intensive bilinear pairing operation is replaced by the scalar multiplication on elliptic curves. Experimental results show that the proposed scheme has good cryptographic properties, and high security level which depends in the difficulty to solve the discrete logarithm problem on elliptic curves (ECDLP)

Proposed Developments of Blind Signature Scheme based on The Elliptic Curve Discrete Logarithm Problem

In recent years, Elliptic Curve Cryptography (ECC) has attracted the attention of researchers due to its robust mathematical structure and highest security compared to other existing algorithm like RSA. Our main objective in this work was to provide a novel blind signature scheme based on ECC. The security of the proposed method results from the infeasibility to solve the discrete logarithm over an elliptic curve. In this paper we introduce a proposed to development the blind signature scheme with more complexity as compared to the existing schemes. Keyword: Cryptography, Blind Signature, Elliptic Curve, Blindness, Untraceability.DOI: 10.18495/comengapp.21.15116